Chebyshev-type integration rules of minimum norm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chebyshev-Type Integration Rules of Minimum Norm

Equal-weight integration rules are studied in the context of certain families of Hubert spaces of analytic functions defined in a family of confocal ellipses containing the interval of integration. Rules which minimize the norm of the error functional in these spaces are shown to exist and several such rules are tabulated. Asymptotic properties of these rules are studied for ellipses shrinking ...

متن کامل

Flexible Integration? Mandatory and Minimum Participation Rules

For a club such as the European Union, an important question is whether a subset of the members should be allowed to form “inner clubs” and enhance cooperation. Flexible cooperation allows members to participate if and only if they benefit, but it leads to free-riding when externalities are positive. I show that flexible cooperation is better if the heterogeneity is large and the externality sm...

متن کامل

A NORM INEQUALITY FOR CHEBYSHEV CENTRES

In this paper, we study the Chebyshev centres of bounded subsets of normed spaces and obtain a norm inequality for relative centres. In particular, we prove that if T is a remotal subset of an inner product space H, and F is a star-shaped set at a relative Chebyshev centre c of T with respect to F, then llx - qT (x)1I2 2 Ilx-cll2 + Ilc-qT (c) 112 x E F, where qT : F + T is any choice functi...

متن کامل

Minimum L1-norm Estimation for Fractional Ornstein-Uhlenbeck Type Process

We investigate the asymptotic properties of the minimum L1-norm estimator of the drift parameter for fractional Ornstein-Uhlenbeck type process satisfying a linear stochastic differential equation driven by a fractional Brownian motion.

متن کامل

On the Minimum Norm

This paper describes a new technique to nd the minimum norm solution of a linear program. The main idea is to reformulate this problem as an unconstrained minimization problem with a convex and smooth objective function. The minimization of this objective function can be carried out by a Newton-type method which is shown to be globally convergent. Furthermore, under certain assumptions, this Ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1970

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1970-0298947-1